Perfect sampling of Jackson queueing networks
نویسندگان
چکیده
منابع مشابه
Perfect sampling of Jackson queueing networks
We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the efficiency of sampling from their exact stationary distribution. We show that perfect sampling is possible, although the underlying Markov chain may have an infinite state space. The main idea is to use a Jackson network with infinite buffers (that has a product form stationary distribution) to b...
متن کاملPerfect Sampling for Multiclass Closed Queueing Networks
In this paper we present an exact sampling method for multiclass closed queuing networks. We consider networks for which stationary distribution does not necessarily have a product form. The proposed method uses a compact representation of sets of states, that is used to derive a bounding chain with significantly lower complexity of one-step transition in the coupling from the past scheme. The ...
متن کاملPerfect sampling for closed queueing networks
In this paper we investigate coupling from the past (CFTP) algorithms for closed queueing networks. The stationary distribution has a product form only in a very limited number of particular cases when queue capacity is nite, and numerical algorithms are intractable due to the cardinality of the state space. Moreover, closed networks do not exhibit any monotonic property enabling e cient CFTP. ...
متن کاملStability of Jackson-type Queueing Networks, I
This paper gives a pathwise construction of Jackson-type queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools...
متن کاملImportance sampling for Jackson networks
Rare event simulation in the context of queueing networks has been an active area of research for more than two decades. A commonly used technique to increase the efficiency of Monte Carlo simulation is importance sampling. However, there are few rigorous results on the design of efficient or asymptotically optimal importance sampling schemes for queueing networks. Using a recently developed ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2015
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-015-9436-z